Strong Geodesic Convex Functions of Order m
نویسندگان
چکیده
منابع مشابه
L-convex Functions and M-convex Functions
In the field of nonlinear programming (in continuous variables) convex analysis [22, 23] plays a pivotal role both in theory and in practice. An analogous theory for discrete optimization (nonlinear integer programming), called " discrete convex analysis " [18, 17], is developed for L-convex and M-convex functions by adapting the ideas in convex analysis and generalizing the results in matroid ...
متن کاملLevel Set Characterization of M-convex Functions
This note shows that level sets of a function characterize an M-convex function introduced by Murota.
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملInequalities for discrete higher order convex functions
[1] E. BOROS AND A. PRÉKOPA, Closed Form Two-Sided Bounds for Probabilities That Exactly r and at Least r out of n Events Occur, Mathematics of Operations Research, 14 (1989), 317–342. [2] D. DAWSON AND A. SANKOFF, An Inequality for Probabilities, Proceedings of the American Mathematical Society, 18 (1967), 504–507. [3] H.P. EDMUNDSON, Bounds on the Expectation of a Convex Function of a Random ...
متن کاملSingular values of convex functions of matrices
Let $A_{i},B_{i},X_{i},i=1,dots,m,$ be $n$-by-$n$ matrices such that $sum_{i=1}^{m}leftvert A_{i}rightvert ^{2}$ and $sum_{i=1}^{m}leftvert B_{i}rightvert ^{2}$ are nonzero matrices and each $X_{i}$ is positive semidefinite. It is shown that if $f$ is a nonnegative increasing convex function on $left[ 0,infty right) $ satisfying $fleft( 0right) =0 $, then $$2s_{j}left( fleft( fra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Functional Analysis and Optimization
سال: 2019
ISSN: 0163-0563,1532-2467
DOI: 10.1080/01630563.2019.1651740